Elliptic Curves Scalar Multiplication Combining Mbnr with Point Halving
نویسندگان
چکیده
Elliptic curves scalar multiplication over some nite elds, attractive research area, which paid much attention by researchers in the recent years. Researchs still in progress to improve elliptic curves cryptography implementation and reducing its complexity. Elliptic curve point-halving algorithm proposed in [11] and later double-base chain [3] and step multi-base chain [19] are among e¢ cient techniques o¤ered in this eld.Our paper proposes new algorithm combining step multi-base number representation and point halving. We extend the work done by [14], which combined double base chain with point halving technique. The expriment results show our contribution will enhance elliptic curves scalar multiplication.
منابع مشابه
Elliptic Curve Point Multiplication Using MBNR and Point Halving
-----------------------------------------------------------------------ABSTRACT---------------------------------------------------------The fast implementation of elliptic curve cryptosystems relies on the efficient computation of scalar multiplication. As generalization of double base number system of a number k to multi-base number system (MBNR) provides a faster method for the scalar multipl...
متن کاملFaster Scalar Multiplication on Koblitz Curves Combining Point Halving with the Frobenius Endomorphism
Let E be an elliptic curve defined over F2n . The inverse operation of point doubling, called point halving, can be done up to three times as fast as doubling. Some authors have therefore proposed to perform a scalar multiplication by an “halve-and-add” algorithm, which is faster than the classical double-and-add method. If the coefficients of the equation defining the curve lie in a small subf...
متن کاملMinimality of the Hamming Weight of the τ -NAF for Koblitz Curves and Improved Combination with Point Halving
In order to efficiently perform scalar multiplications on elliptic Koblitz curves, expansions of the scalar to a complex base associated with the Frobenius endomorphism are commonly used. One such expansion is the τ -adic NAF, introduced by Solinas. Some properties of this expansion, such as the average weight, are well known, but in the literature there is no proof of its optimality, i.e. that...
متن کاملMinimality of the Hamming Weight of the T-NAF for Koblitz Curves and Improved Combination with Point Halving
In order to efficiently perform scalar multiplications on elliptic Koblitz curves, expansions of the scalar to a complex base associated with the Frobenius endomorphism are commonly used. One such expansion is the τ -adic NAF, introduced by Solinas. Some properties of this expansion, such as the average weight, are well known, but in the literature there is no proof of its optimality, i.e. that...
متن کاملFast elliptic scalar multiplication using new double-base chain and point halving
The fast implementation of elliptic curve cryptosystems relies on the efficient computation of scalar multiplication. Based on the double-base chain representation of scalar using powers of 2 and 3, we propose a new representation with powers of 1⁄2 and 3 instead. Thus the efficient point halving operation can be incorporated in the new double-base chain to achieve fast scalar multiplication. E...
متن کامل